Quasi-Static Scheduling for Multiprocessor DSP
نویسندگان
چکیده
Scheduliig strategies for multiprocessor DSP are classified into four types: fully-dynamic, static-assignment, self-timed, and fully-static. The concept of static scheduling (self-timed or fullystatic) is extended to handle non-deterministic actors in the proposed quasi-static scheduling. Quasi-static scheduling minimizes run-time overhead with increased compilation complexity, thus adequate for signal processing applications. The proposed scheme is applicable to dynamic (static-assignment) scheduling strategy as well as to static (self-timed) scheduling.
منابع مشابه
Multiprocessor scheduling of dataflow models within the Reconfigurable Video Coding framework
The new Reconfigurable Video Coding (RVC) standard of MPEG marks a transition in the way video coding algorithms are specified. Imperative and monolithic reference software is replaced by a collection of interconnected, concurrent functional units (FUs) that are specified with the actor-oriented CAL language. Different connections between the FUs lead to different decoders: all previous standar...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملA two-level scheduling method: an effective parallelizing technique for uniform nested loops on a DSP multiprocessor
A digital signal processor (DSP), which is a special-purpose microprocessor, is designed to achieve higher performance on DSP applications. Because most DSP applications contain many nested loops and permit a very high degree of parallelism, the DSP multiprocessor has a suitable architecture to execute these applications. Unfortunately, conventional scheduling methods used on DSP multiprocessor...
متن کاملA Comparative Study of Multiprocessor List Scheduling Heuristics
This paper presents a quantitative comparison of a collection of DSP multiprocessor list scheduling heuristics which consider inter-processor communication delays. The following aspects have been addressed: (1) performance in terms of the total execution time (makespan), (2) sensitivity of heuristics in terms of the characteristics of acyclic precedence graphs, including graph size and graph pa...
متن کاملThe utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline al...
متن کامل